Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
نویسندگان
چکیده
We present a generic scheme for approximating NP-hard problems on graphs of treewidth k = ω(log n). When a tree-decomposition of width ` is given, the scheme typically yields an `/ lg n-approximation factor; otherwise, an extra log k factor is incurred. Our method applies to several basic subgraph and partitioning problems, including the maximum independent set problem.
منابع مشابه
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth
In this paper we present two novel generic schemes for approximation algorithms for optimization NP-hard graph problems constrained to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k = polylog(n). The second scheme yields randomized polynomialtime algorithms achieving an approximation factor of k/ ...
متن کاملLP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
We give a general approach to solve various optimization problems on noisy minor-free and bounded treewidth graphs, where some fraction of the edges have been corrupted adversarially. Our results are motivated by a previous work of Magen and Moharrami, who gave a (1 + )approximate estimation algorithm for the independent set problem on noisy planar graphs, but left open the question of how to a...
متن کاملApproximation algorithms for classes of graphs excluding single-crossing graphs as minors
Many problems that are intractable for general graphs allow polynomial-time solutions for structured classes of graphs, such as planar graphs and graphs of bounded treewidth. In this paper, we demonstrate structural properties of larger classes of graphs and show how to exploit the properties to obtain algorithms. The classes considered are those formed by excluding as a minor a graph that can ...
متن کاملCombinatorial Optimization on Graphs of Bounded Treewidth
There are many graph problems that can be solved in linear or polynomial time with a dynamic programming algorithm when the input graph has bounded treewidth. For combinatorial optimization problems, this is a useful approach for obtaining fixed-parameter tractable algorithms. Starting from trees and series-parallel graphs, we introduce the concepts of treewidth and tree decompositions, and ill...
متن کاملReduction Algorithms for Graphs of Small Treewidth
This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. Arnborg et al. [2] have shown that many decision problems on graphs can be solved in linear time on graphs of bounded treewidth, by using a finite set of reduction rules. These algorithms can be used to solve problems on graphs of bounded treewidth without the need to first obtain a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 94 شماره
صفحات -
تاریخ انتشار 2005